A distributed deadlock resolution algorithm with a linear message complexity
نویسندگان
چکیده
In this paper we introduce a new distributed deadlock detection/resolution algorithm that achieves a linear message complexity. This proposal is based on the operation and behaviour of an election algorithm designed for logical rings in totally connected networks. The algorithm operates like that election algorithm in static configurations and tries to minimize the number of messages transmitted in dynamic ones, ensuring messages remain while their information is up-to-date.
منابع مشابه
Efficient algorithms for detection and resolution of distributed deadlocks
We present a simple and efficient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-€or graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an “image” of the WF...
متن کاملComparing factor Bracha -
We present a simple and eecient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-for graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an \image" of the WFG ...
متن کاملOptimal Deadlock Detection in Distributed Systems Based on Locally Constructed Wait-for Graphs - Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case mes...
متن کاملOptimal Deadlock Detection in Distributed Systems Based on Locally Constructed Wait-for Graphs
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case mes...
متن کاملAn O(n) Distributed Deadlock Resolution Algorithm: Correctness Proof
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n − 1 messages and a latency of n ·T for a deadlock cycle of n processes, where T is the inter-site communication delay. The algorithm achieves this improvemen...
متن کامل